Calculus of embeddings
نویسندگان
چکیده
منابع مشابه
Calculus of Embeddings
Let M and N be smooth manifolds, where M ⊂ N and dim(N)− dim(M) ≥ 3. A disjunction lemma for embeddings proved recently by Goodwillie leads to a calculation up to extension problems of the base point component of the space of smooth embeddings of M in N . This is mostly in terms of imm(M,N), the space of smooth immersions, which is well understood, and embedding spaces emb(S,N) for finite subse...
متن کاملExtending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings
Our motivation is the question whether the lazy lambda calculus, a pure lambda calculus with the leftmost outermost rewriting strategy, considered under observational semantics, or extensions thereof, are an adequate model for semantic equivalences in real-world purely functional programming languages, in particular for a pure core language of Haskell. We explore several extensions of the lazy ...
متن کاملConservativity of Embeddings in the lambda Pi Calculus Modulo Rewriting
The λΠ calculus can be extended with rewrite rules to embed any functional pure type system. In this paper, we show that the embedding is conservative by proving a relative form of normalization, thus justifying the use of the λΠ calculus modulo rewriting as a logical framework for logics based on pure type systems. This result was previously only proved under the condition that the target syst...
متن کاملConservativity of Embeddings in the λΠ Calculus Modulo Rewriting
The λΠ calculus can be extended with rewrite rules to embed any functional pure type system. In this paper, we show that the embedding is conservative by proving a relative form of normalization, thus justifying the use of the λΠ calculus modulo rewriting as a logical framework for logics based on pure type systems. This result was previously only proved under the condition that the target syst...
متن کاملA Typed Calculus Supporting Shallow Embeddings of Abstract Machines
machines and reductions in a system of proof terms for a version the sequent calculus. We believe that by doing so we shed light on some essential characteristics of abstract machines, proofs in sequent calculus systems, and weak normalization of λ-terms. The machines that we consider are the (callby-name) Krivine machine and a call-by-value machine that may be called a “right-to-left CEK machi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1996
ISSN: 0273-0979
DOI: 10.1090/s0273-0979-96-00657-x